The Double Traveling Salesman Problem with Multiple Stacks and a Choice of Container Types
نویسندگان
چکیده
منابع مشابه
A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
The double traveling salesman problem with multiple stacks is a variant of the pickup and delivery traveling salesman problem in which all pickups must be completed before any of the deliveries. In addition, items can be loaded on multiple stacks in the vehicle and each stack must obey the last-in-first-out policy. The problem consists in finding the shortest Hamiltonian cycles covering all pic...
متن کاملThe Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
In the uncapacitated asymmetric traveling salesman with multiple stacks, we perform a hamiltonian circuit to pick up n items, storing them in a vehicle with k stacks satisfying last-in-first-out constraints, and then we deliver every item by performing a hamiltonian circuit. We are interested in the convex hull of the (arc-)incidence vectors of such couples of hamiltonian circuits. For the gene...
متن کاملA Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks
In the double TSP with multiple stacks, a vehicle with several stacks performs a Hamiltonian circuit to pick up some items and stores them in its stacks. It then delivers every item by performing another Hamiltonian circuit while satisfying the last-in-first-out policy of its stacks. The consistency requirement ensuring that the pickup and delivery circuits can be performed by the vehicle is th...
متن کاملA branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
This paper studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last-in-first-out constraint which states that any new item must be loaded on top of a stack and any unloaded item must be on top of its stack. A branch-and-...
متن کاملPolyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks
In the double TSP with multiple stacks, one performs a Hamiltonian circuit to pick up n items, storing them in a vehicle with s stacks of finite capacity q satisfying lastin-first-out constraints, and then delivers every item by performing a Hamiltonian circuit. We introduce an integer linear programming formulation with arc and precedence variables. We show that the underlying polytope shares ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2020
ISSN: 2227-7390
DOI: 10.3390/math8060979